A Monte Carlo search uses random choices as part of the search algorithm. An extreme case is random generate and test, choosing points in the search space at random until one satisfies the search criterion. However, forms of Monte Carlo search can also use heuristics to nudge the algorothm towards more likely parts of the search space.